A Cartesian cut cell based two-way strong fluid–solid coupling algorithm for 2D floating bodies

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-way coupling of fluids to reduced deformable bodies

We propose a fully monolithic two-way coupling framework that couples incompressible fluids to reduced deformable bodies. Notably, the resulting linear system matrix is both symmetric and positive-definite. Our method allows for the simulation of interesting free-surface as well as underwater phenomena, enabling the use of reduced deformable bodies as full-fledged simulation primitives alongsid...

متن کامل

A novel Cartesian CFD cut cell approach

Article history: Received 22 October 2011 Received in revised from 14 February 2013 Accepted 22 March 2013 Available online 2 April 2013

متن کامل

Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...

متن کامل

Real-Time Physical Engine for Floating Objects with Two-Way Fluid-Structure Coupling

A method to simulate graphic animations of objects floating in a water surface in real time is presented. The fluid is simulated by means of the Lattice Boltzmann method for the shallow-waters equations and the movement of the floating objects is calculated with a Newtonian physical engine suitable for the mechanics of rigid bodies. A two-way interaction between the fluid surface and the object...

متن کامل

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Fluids and Structures

سال: 2016

ISSN: 0889-9746

DOI: 10.1016/j.jfluidstructs.2016.01.008